Reducing the Amount of Pivoting in Symmetric Indefinite Systems
نویسندگان
چکیده
This paper illustrates how the communication due to pivoting in the solution of symmetric indefinite linear systems can be reduced by considering innovative approaches that are different from pivoting strategies implemented in current linear algebra libraries. First a tiled algorithm where pivoting is performed within a tile is described and then an alternative to pivoting is proposed. The latter considers a symmetric randomization of the original matrix using the so-called recursive butterfly matrices. In numerical experiments, the accuracy of tile-wise pivoting and of the randomization approach is compared with the accuracy of the Bunch-Kaufman algorithm.
منابع مشابه
A study of pivoting strategies for tough sparse indefinite systems
The performance of a sparse direct solver is dependent upon the pivot sequence that is chosen during the analyse phase. In the case of symmetric indefinite systems, it may be necessary to modify this sequence during the factorization to ensure numerical stability. Delaying pivots can have serious consequences in terms of time as well as the memory and flops required for the factorization and su...
متن کاملAnalysis of Block LDL Factorizations for Symmetric Indefinite Matrices∗
We consider the block LDL factorizations for symmetric indefinite matrices in the form LBL , where L is unit lower triangular and B is block diagonal with each diagonal block having dimension 1 or 2. The stability of this factorization and its application to solving linear systems has been well-studied in the literature. In this paper we give a condition under which the LBL factorization will r...
متن کاملTowards a stable static pivoting strategy for the sequential and parallel solution of sparse symmetric indefinite systems
We consider the direct solution of sparse symmetric indefinite matrices. We develop new pivoting strategies that combine numerical and static pivoting. Furthermore, we propose original approaches that are designed for parallel distributed factorization. We show that our pivoting strategies are numerically robust and that the factorization is significantly faster because of this static/numerical...
متن کاملCompressed threshold pivoting for sparse symmetric indefinite systems
A key technique for controlling numerical stability in sparse direct solvers is threshold partial pivoting. When selecting a pivot, the entire candidate pivot column below the diagonal must be up-to-date and must be scanned. If the factorization is parallelized across a large number of cores, communication latencies can be the dominant computational cost. In this paper, we propose two alternati...
متن کاملThe Snap-Back Pivoting Method for Symmetric Banded Indefinite Matrices
The four existing stable factorization methods for symmetric indefinite pivoting (row or column exchanges) maintains a band structure in the reduced matrix and the factors, but destroys symmetry completely once an off-diagonal pivot is used. Two-by-two block pivoting maintains symmetry at all times, but quickly destroys the band structure. Gaussian reduction to tridiagonal also maintains symmet...
متن کامل